On monochromatic component size for improper colourings
نویسندگان
چکیده
منابع مشابه
On monochromatic component size for improper colourings
This paper concerns improper λ-colourings of graphs and focuses on the sizes of the monochromatic components (i.e., components of the subgraphs induced by the colour classes). Consider the following three simple operations, which should, heuristically, help reduce monochromatic component size: (a) assign to a vertex the colour that is least popular among its neighbours; (b) change the colours o...
متن کاملImproper Colourings of Unit Disk Graphs
We investigate the following problem proposed by Alcatel. A satellite sends information to receivers on earth, each of which is listening on a chosen frequency. Technically, it is impossible for the satellite to precisely focus its signal onto a receiver. Part of the signal will be spread in an area around its destination and this creates noise for nearby receivers on the same frequency. Howeve...
متن کاملMonochromatic Cycle Partitions in Local Edge Colourings
An edge colouring of a graph is said to be an r-local colouring if the edges incident to any vertex are coloured with at most r colours. Generalising a result of Bessy and Thomassé, we prove that the vertex set of any 2-locally coloured complete graph may be partitioned into two disjoint monochromatic cycles of different colours. Moreover, for any natural number r, we show that the vertex set o...
متن کاملOn Colourings of Hypergraphs Without Monochromatic Fano Planes
For k-uniform hypergraphs F and H and an integer r ≥ 2, let cr,F (H) denote the number of r-colorings of the set of hyperedges of H with no monochromatic copy of F and let cr,F (n) = maxH∈Hn cr,F (H), where the maximum runs over all k-uniform hypergraphs on n vertices. Moreover, let ex(n, F ) be the usual extremal or Turán function, i.e., the maximum number of hyperedges of an n-vertex k-unifor...
متن کاملEdge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
Let k and ` be positive integers. With a graph G, we associate the quantity ck,`(G), the number of k-colorings of the edge set of G with no monochromatic matching of size `. Consider the function ck,` : N −→ N given by ck,`(n) = max {ck,`(G) : |V (G)| = n}, the maximum of ck,`(G) over all graphs G on n vertices. In this paper, we determine ck,`(n) and the corresponding extremal graphs for all l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.10.005